'''
Don't Copy This Code, Try To Solve It By Yourself
'''
def Solve():
for t in range(int(input())):
dict_={}
for n in range(int(input())):
b, d = map(int, input().split())
if d not in dict_.keys():
dict_[d]=[b]
else:
dict_[d].append(b)
if len(dict_.keys()) != 10:
print("MOREPROBLEMS")
else:
Sum=0
for value in dict_.values():
Sum+=max(value)
print(Sum)
if __name__ == "__main__":
Solve()#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define ll long long int
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define cin(arr,n) for(int i=0; i<n;i++){cin>>arr[i];}
#define endl "\n"
#define cin1(vec,n) forn(i,n){ll x;cin>>x;vec.push_back(x);}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t;
cin>>t;
while(t--){
ll n;
cin>>n;
map<ll,ll>mp;
for(int i=0;i<n;i++){
ll x,y;
cin>>x>>y;
if(mp[y]<=x){
mp[y]=x;
}
}
ll ct=0;
ll ans=0;
for(auto it:mp){
ans+=(it.second);
ct++;
}
if(ct<10){
cout<<"MOREPROBLEMS"<<endl;
}
else{
cout<<ans<<endl;
}
}
return 0;
}WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |
1032A - Kitchen Utensils | 1501B - Napoleon Cake |
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |
1521A - Nastia and Nearly Good Numbers | 208. Implement Trie |
1605B - Reverse Sort | 1607C - Minimum Extraction |
1604B - XOR Specia-LIS-t | 1606B - Update Files |
1598B - Groups | 1602B - Divine Array |
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |